CSCI 151 Data Structures Fall 2017 Lecture: MWF 8:10-9:00 (A1), MC Reynolds 315 Lab: T 1:10-4:00 (L7), WAC 249 Website: http://ozark.hendrix.edu/~yorgey/151/

Source URL: ozark.hendrix.edu

Fast, Multicore-Scalable, Low-Fragmentation Memory Allocation through Large Virtual Memory and Global Data Structures Ar tifact * Complete

Source URL: cs.uni-salzburg.at

OpLog: a library for scaling update-heavy data structures Silas Boyd-Wickizer, M. Frans Kaashoek, Robert Morris, and Nickolai Zeldovich MIT CSAIL Abstract

Source URL: people.csail.mit.edu

Separation Logic: A Logic for Shared Mutable Data Structures John C. Reynolds∗ Computer Science Department Carnegie Mellon University

Source URL: www.cs.cmu.edu

• Mathematics
• Abstract algebra
• Algebra
• Constructible universe
• Lie algebras
• Lie groups
• Field theory
• CurryHoward correspondence
• Generalised Whitehead product

Mergeable persistent data structures Benjamin Farinier1 , Thomas Gazagnaire2 and Anil Madhavapeddy2 1: ENS Lyon 2: University of Cambridge

Source URL: anil.recoil.org

A Comparison of Data Structures to Manage URIs on the Web of Data Ruslan Mavlyutov, Marcin Wylot, and Philippe Cudre-Mauroux eXascale Infolab, University of Fribourg—Switzerland {firstname.lastname}@unifr.ch

Source URL: exascale.info

The Computability of Relaxed Data Structures: Queues and Stacks as Examples∗ Nir Shavit† Gadi Taubenfeld‡

Source URL: www.faculty.idc.ac.il

Public Data Structures: Counters as a Special Case∗ Hagit Brit† Shlomo Moran†‡ Gadi Taubenfeld§

Source URL: www.faculty.idc.ac.il

B.Comp.Dissertation "Online Judge" for Data Structures and Algorithms Course by

Source URL: visualgo.net